A Robust Collaborative Recommendation Algorithm Incorporating Trustworthy Neighborhood Model
نویسندگان
چکیده
The conventional collaborative recommendation algorithms are quite vulnerable to user profile injection attacks. To solve this problem, in this paper we propose a robust collaborative recommendation algorithm incorporating trustworthy neighborhood model. Firstly, we present a method to calculate the users’ degree of suspicion based on the user-item ratings data using the theory of entropy and the idea of density-based local outlier factor. Based on it, we measure the user’s trust attributes from different angles by introducing the source credibility theory and propose a multidimensional trust model incorporating users’ degree of suspicion. Then we propose a trustworthy neighborhood model by combining the baseline estimate approach with the multidimensional trust model. Finally, we devise a robust collaborative recommendation algorithm to provide more accurate recommendation for the target user by integrating the M-estimator based matrix factorization approach and the trustworthy neighborhood model. Experimental results on the MovieLens dataset show that the proposed algorithm has better robustness in comparison with the existing collaborative recommendation algorithms.
منابع مشابه
A Robust Modeling Of Inventory Routing In Collaborative Reverse Supply Chains
This paper proposes a robust model for optimizing collaborative reverse supply chains. The primary idea is to develop a collaborative framework that can achieve the best solutions in the uncertain environment. Firstly, we model the exact problem in the form of a mixed integer nonlinear programming. To regard uncertainty, the robust optimization is employed that searches for an optimum answer wi...
متن کاملA Robust Collaborative Filtering Recommendation Algorithm Based on Multidimensional Trust Model
Collaborative filtering is one of the widely used technologies in the e-commerce recommender systems. It can predict the interests of a user based on the rating information of many other users. But the traditional collaborative filtering recommendation algorithm has the problems such as lower recommendation precision and weaker robustness. To solve these problems, in this paper we present a rob...
متن کاملA New Similarity Measure Based on Item Proximity and Closeness for Collaborative Filtering Recommendation
Recommender systems utilize information retrieval and machine learning techniques for filtering information and can predict whether a user would like an unseen item. User similarity measurement plays an important role in collaborative filtering based recommender systems. In order to improve accuracy of traditional user based collaborative filtering techniques under new user cold-start problem a...
متن کاملA Combined Stochastic Programming and Robust Optimization Approach for Location-Routing Problem and Solving it via Variable Neighborhood Search algorithm
The location-routing problem is one of the combined problems in the area of supply chain management that simultaneously make decisions related to location of depots and routing of the vehicles. In this paper, the single-depot capacitated location-routing problem under uncertainty is presented. The problem aims to find the optimal location of a single depot and the routing of vehicles to serve th...
متن کاملCollaborative Filtering: Weighted Nonnegative Matrix Factorization Incorporating User and Item Graphs
Collaborative filtering is an important topic in data mining and has been widely used in recommendation system. In this paper, we proposed a unified model for collaborative filtering based on graph regularized weighted nonnegative matrix factorization. In our model, two graphs are constructed on users and items, which exploit the internal information (e.g. neighborhood information in the user-i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- JCP
دوره 9 شماره
صفحات -
تاریخ انتشار 2014